Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization

Nonnegative matrix factorization (NMF) under the separability assumption can provably be solved efficiently, even in the presence of noise, and has been shown to be a powerful technique in document classification and hyperspectral unmixing. This problem is referred to as near-separable NMF and requires that there exists a cone spanned by a small subset of the columns of the input nonnegative ma...

متن کامل

Robust near-separable nonnegative matrix factorization using linear optimization

Nonnegative matrix factorization (NMF) has been shown recently to be tractable under the separability assumption, which amounts for the columns of the input data matrix to belong to the convex cone generated by a small number of columns. Bittorf, Recht, Ré and Tropp (‘Factoring nonnegative matrices with linear programs’, NIPS 2012) proposed a linear programming (LP) model, referred to as HottTo...

متن کامل

Nonnegative matrix factorization with quadratic programming

Nonnegative Matrix Factorization (NMF) solves the following problem: find such nonnegative matrices A ∈ RI×J + and X ∈ RJ×K + that Y ∼= AX, given only Y ∈ RI×K and the assigned index J (K >> I ≥ J). Basically, the factorization is achieved by alternating minimization of a given cost function subject to nonnegativity constraints. In the paper, we propose to use Quadratic Programming (QP) to solv...

متن کامل

Robust Watermarking based on Subsampling and Nonnegative Matrix Factorization

This paper presents a novel robust digital image watermarking scheme using subsampling and nonnegative matrix factorization. Firstly, subsampling is used to construct a subimage sequence. Then, based on the column similarity of the subimage sequence, nonnegative matrix factorization (NMF) is applied to decompose the sequence. A Gaussian pseudo-random watermark sequence is embedded in the factor...

متن کامل

Robust watermarking based on DWT and nonnegative matrix factorization

Article history: Received 16 September 2007 Received in revised form 1 July 2008 Accepted 16 September 2008 Available online 5 November 2008

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2015

ISSN: 1052-6234,1095-7189

DOI: 10.1137/130940670